TSTP Solution File: ITP208^3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP208^3 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:07:21 EDT 2024

% Result   : Theorem 9.12s 6.05s
% Output   : CNFRefutation 9.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   46 (  12 unt;  14 typ;   0 def)
%            Number of atoms       :   74 (  38 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  248 (  36   ~;  30   |;   0   &; 170   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   9 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   8 con; 0-5 aty)
%            Number of variables   :   98 (   0   ^  98   !;   0   ?;  98   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    heap_e7401611519738050253t_unit: $tType ).

thf(decl_sort2,type,
    array_a: $tType ).

thf(decl_sort3,type,
    heap_Time_Heap_nat: $tType ).

thf(decl_sort4,type,
    nat: $tType ).

thf(decl_30,type,
    array_len_a: array_a > heap_Time_Heap_nat ).

thf(decl_34,type,
    array_length_a: heap_e7401611519738050253t_unit > array_a > nat ).

thf(decl_338,type,
    one_one_nat: nat ).

thf(decl_407,type,
    heap_Time_effect_nat: heap_Time_Heap_nat > heap_e7401611519738050253t_unit > heap_e7401611519738050253t_unit > nat > nat > $o ).

thf(decl_874,type,
    a: array_a ).

thf(decl_875,type,
    h: heap_e7401611519738050253t_unit ).

thf(decl_876,type,
    h2: heap_e7401611519738050253t_unit ).

thf(decl_877,type,
    n: nat ).

thf(decl_878,type,
    r: nat ).

thf(decl_879,type,
    thesis: $o ).

thf(fact_55_effect__deterministic_I2_J,axiom,
    ! [X12: heap_Time_Heap_nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X17: nat,X5: nat,X14: heap_e7401611519738050253t_unit,X15: nat,X16: nat] :
      ( ( heap_Time_effect_nat @ X12 @ X2 @ X1 @ X17 @ X5 )
     => ( ( heap_Time_effect_nat @ X12 @ X2 @ X14 @ X15 @ X16 )
       => ( X1 = X14 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',fact_55_effect__deterministic_I2_J) ).

thf(fact_2_effect__lengthI,axiom,
    ! [X1: heap_e7401611519738050253t_unit,X2: heap_e7401611519738050253t_unit,X3: nat,X4: array_a,X5: nat] :
      ( ( X1 = X2 )
     => ( ( X3
          = ( array_length_a @ X2 @ X4 ) )
       => ( ( X5 = one_one_nat )
         => ( heap_Time_effect_nat @ ( array_len_a @ X4 ) @ X2 @ X1 @ X3 @ X5 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',fact_2_effect__lengthI) ).

thf(fact_0_assms,axiom,
    heap_Time_effect_nat @ ( array_len_a @ a ) @ h @ h2 @ r @ n,
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',fact_0_assms) ).

thf(conj_1,conjecture,
    thesis,
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',conj_1) ).

thf(fact_1_that,axiom,
    ( ( r
      = ( array_length_a @ h2 @ a ) )
   => ( ( h2 = h )
     => ( ( n = one_one_nat )
       => thesis ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',fact_1_that) ).

thf(fact_56_effect__deterministic_I1_J,axiom,
    ! [X12: heap_Time_Heap_nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X18: nat,X5: nat,X14: heap_e7401611519738050253t_unit,X15: nat,X16: nat] :
      ( ( heap_Time_effect_nat @ X12 @ X2 @ X1 @ X18 @ X5 )
     => ( ( heap_Time_effect_nat @ X12 @ X2 @ X14 @ X15 @ X16 )
       => ( X18 = X15 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',fact_56_effect__deterministic_I1_J) ).

thf(fact_54_effect__deterministic_I3_J,axiom,
    ! [X12: heap_Time_Heap_nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X13: nat,X5: nat,X14: heap_e7401611519738050253t_unit,X15: nat,X16: nat] :
      ( ( heap_Time_effect_nat @ X12 @ X2 @ X1 @ X13 @ X5 )
     => ( ( heap_Time_effect_nat @ X12 @ X2 @ X14 @ X15 @ X16 )
       => ( X5 = X16 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p',fact_54_effect__deterministic_I3_J) ).

thf(c_0_7,plain,
    ! [X17525: heap_Time_Heap_nat,X17526: heap_e7401611519738050253t_unit,X17527: heap_e7401611519738050253t_unit,X17528: nat,X17529: nat,X17530: heap_e7401611519738050253t_unit,X17531: nat,X17532: nat] :
      ( ~ ( heap_Time_effect_nat @ X17525 @ X17526 @ X17527 @ X17528 @ X17529 )
      | ~ ( heap_Time_effect_nat @ X17525 @ X17526 @ X17530 @ X17531 @ X17532 )
      | ( X17527 = X17530 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_55_effect__deterministic_I2_J])])]) ).

thf(c_0_8,plain,
    ! [X16002: heap_e7401611519738050253t_unit,X16003: heap_e7401611519738050253t_unit,X16004: nat,X16005: array_a,X16006: nat] :
      ( ( X16002 != X16003 )
      | ( X16004
       != ( array_length_a @ X16003 @ X16005 ) )
      | ( X16006 != one_one_nat )
      | ( heap_Time_effect_nat @ ( array_len_a @ X16005 ) @ X16003 @ X16002 @ X16004 @ X16006 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_effect__lengthI])])]) ).

thf(c_0_9,plain,
    ! [X3: nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X5: nat,X6: nat,X14: heap_e7401611519738050253t_unit,X12: heap_Time_Heap_nat,X11: nat] :
      ( ( X2 = X14 )
      | ~ ( heap_Time_effect_nat @ X12 @ X1 @ X2 @ X3 @ X5 )
      | ~ ( heap_Time_effect_nat @ X12 @ X1 @ X14 @ X6 @ X11 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    heap_Time_effect_nat @ ( array_len_a @ a ) @ h @ h2 @ r @ n,
    inference(split_conjunct,[status(thm)],[fact_0_assms]) ).

thf(c_0_11,plain,
    ! [X3: nat,X4: array_a,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X5: nat] :
      ( ( heap_Time_effect_nat @ ( array_len_a @ X4 ) @ X2 @ X1 @ X3 @ X5 )
      | ( X1 != X2 )
      | ( X3
       != ( array_length_a @ X2 @ X4 ) )
      | ( X5 != one_one_nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ~ thesis,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).

thf(c_0_13,plain,
    ! [X3: nat,X1: heap_e7401611519738050253t_unit,X5: nat] :
      ( ( X1 = h2 )
      | ~ ( heap_Time_effect_nat @ ( array_len_a @ a ) @ h @ X1 @ X3 @ X5 ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_14,plain,
    ! [X1: heap_e7401611519738050253t_unit,X4: array_a] : ( heap_Time_effect_nat @ ( array_len_a @ X4 ) @ X1 @ X1 @ ( array_length_a @ X1 @ X4 ) @ one_one_nat ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])])]) ).

thf(c_0_15,plain,
    ( ( r
     != ( array_length_a @ h2 @ a ) )
    | ( h2 != h )
    | ( n != one_one_nat )
    | thesis ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_that])]) ).

thf(c_0_16,negated_conjecture,
    ~ thesis,
    inference(fof_nnf,[status(thm)],[c_0_12]) ).

thf(c_0_17,plain,
    ! [X17533: heap_Time_Heap_nat,X17534: heap_e7401611519738050253t_unit,X17535: heap_e7401611519738050253t_unit,X17536: nat,X17537: nat,X17538: heap_e7401611519738050253t_unit,X17539: nat,X17540: nat] :
      ( ~ ( heap_Time_effect_nat @ X17533 @ X17534 @ X17535 @ X17536 @ X17537 )
      | ~ ( heap_Time_effect_nat @ X17533 @ X17534 @ X17538 @ X17539 @ X17540 )
      | ( X17536 = X17539 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_56_effect__deterministic_I1_J])])]) ).

thf(c_0_18,plain,
    h = h2,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_19,plain,
    ( thesis
    | ( r
     != ( array_length_a @ h2 @ a ) )
    | ( h2 != h )
    | ( n != one_one_nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_20,negated_conjecture,
    ~ thesis,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_21,plain,
    ! [X3: nat,X2: heap_e7401611519738050253t_unit,X5: nat,X1: heap_e7401611519738050253t_unit,X6: nat,X14: heap_e7401611519738050253t_unit,X12: heap_Time_Heap_nat,X11: nat] :
      ( ( X3 = X6 )
      | ~ ( heap_Time_effect_nat @ X12 @ X1 @ X2 @ X3 @ X5 )
      | ~ ( heap_Time_effect_nat @ X12 @ X1 @ X14 @ X6 @ X11 ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_22,plain,
    heap_Time_effect_nat @ ( array_len_a @ a ) @ h2 @ h2 @ r @ n,
    inference(rw,[status(thm)],[c_0_10,c_0_18]) ).

thf(c_0_23,plain,
    ! [X17517: heap_Time_Heap_nat,X17518: heap_e7401611519738050253t_unit,X17519: heap_e7401611519738050253t_unit,X17520: nat,X17521: nat,X17522: heap_e7401611519738050253t_unit,X17523: nat,X17524: nat] :
      ( ~ ( heap_Time_effect_nat @ X17517 @ X17518 @ X17519 @ X17520 @ X17521 )
      | ~ ( heap_Time_effect_nat @ X17517 @ X17518 @ X17522 @ X17523 @ X17524 )
      | ( X17521 = X17524 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_54_effect__deterministic_I3_J])])]) ).

thf(c_0_24,plain,
    ( ( ( array_length_a @ h2 @ a )
     != r )
    | ( h != h2 )
    | ( n != one_one_nat ) ),
    inference(sr,[status(thm)],[c_0_19,c_0_20]) ).

thf(c_0_25,plain,
    ! [X3: nat,X1: heap_e7401611519738050253t_unit,X5: nat] :
      ( ( X3 = r )
      | ~ ( heap_Time_effect_nat @ ( array_len_a @ a ) @ h2 @ X1 @ X3 @ X5 ) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

thf(c_0_26,plain,
    ! [X3: nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X5: nat,X6: nat,X14: heap_e7401611519738050253t_unit,X12: heap_Time_Heap_nat,X11: nat] :
      ( ( X5 = X11 )
      | ~ ( heap_Time_effect_nat @ X12 @ X1 @ X2 @ X3 @ X5 )
      | ~ ( heap_Time_effect_nat @ X12 @ X1 @ X14 @ X6 @ X11 ) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

thf(c_0_27,plain,
    ( ( ( array_length_a @ h2 @ a )
     != r )
    | ( n != one_one_nat ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]) ).

thf(c_0_28,plain,
    ( ( array_length_a @ h2 @ a )
    = r ),
    inference(spm,[status(thm)],[c_0_25,c_0_14]) ).

thf(c_0_29,plain,
    ! [X5: nat,X1: heap_e7401611519738050253t_unit,X3: nat] :
      ( ( X3 = n )
      | ~ ( heap_Time_effect_nat @ ( array_len_a @ a ) @ h2 @ X1 @ X5 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_26,c_0_22]) ).

thf(c_0_30,plain,
    n != one_one_nat,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).

thf(c_0_31,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.06/2.11  % Problem    : ITP208^3 : TPTP v8.1.2. Released v8.1.0.
% 2.11/2.12  % Command    : run_E %s %d THM
% 2.13/2.33  % Computer : n024.cluster.edu
% 2.13/2.33  % Model    : x86_64 x86_64
% 2.13/2.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.13/2.33  % Memory   : 8042.1875MB
% 2.13/2.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 2.13/2.33  % CPULimit   : 300
% 2.13/2.33  % WCLimit    : 300
% 2.13/2.33  % DateTime   : Fri May  3 12:49:52 EDT 2024
% 2.13/2.33  % CPUTime    : 
% 4.26/4.43  Running higher-order theorem proving
% 4.26/4.43  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.EgTVo3aJib/E---3.1_31233.p
% 9.12/6.05  # Version: 3.1.0-ho
% 9.12/6.05  # partial match(1): HMLMSMSMSSLCHFA
% 9.12/6.05  # Preprocessing class: HMLMSMLMSSLCHFA.
% 9.12/6.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.12/6.05  # Starting new_ho_10 with 1500s (5) cores
% 9.12/6.05  # Starting sh5l with 300s (1) cores
% 9.12/6.05  # Starting new_bool_1 with 300s (1) cores
% 9.12/6.05  # Starting new_bool_2 with 300s (1) cores
% 9.12/6.05  # new_bool_1 with pid 31313 completed with status 0
% 9.12/6.05  # Result found by new_bool_1
% 9.12/6.05  # partial match(1): HMLMSMSMSSLCHFA
% 9.12/6.05  # Preprocessing class: HMLMSMLMSSLCHFA.
% 9.12/6.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.12/6.05  # Starting new_ho_10 with 1500s (5) cores
% 9.12/6.05  # Starting sh5l with 300s (1) cores
% 9.12/6.05  # Starting new_bool_1 with 300s (1) cores
% 9.12/6.05  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 9.12/6.05  # Search class: HGHSM-SSLM32-DHFFFSBN
% 9.12/6.05  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 9.12/6.05  # Starting new_ho_10 with 181s (1) cores
% 9.12/6.05  # new_ho_10 with pid 31316 completed with status 0
% 9.12/6.05  # Result found by new_ho_10
% 9.12/6.05  # partial match(1): HMLMSMSMSSLCHFA
% 9.12/6.05  # Preprocessing class: HMLMSMLMSSLCHFA.
% 9.12/6.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.12/6.05  # Starting new_ho_10 with 1500s (5) cores
% 9.12/6.05  # Starting sh5l with 300s (1) cores
% 9.12/6.05  # Starting new_bool_1 with 300s (1) cores
% 9.12/6.05  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 9.12/6.05  # Search class: HGHSM-SSLM32-DHFFFSBN
% 9.12/6.05  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 9.12/6.05  # Starting new_ho_10 with 181s (1) cores
% 9.12/6.05  # Preprocessing time       : 0.023 s
% 9.12/6.05  # Presaturation interreduction done
% 9.12/6.05  
% 9.12/6.05  # Proof found!
% 9.12/6.05  # SZS status Theorem
% 9.12/6.05  # SZS output start CNFRefutation
% See solution above
% 9.12/6.05  # Parsed axioms                        : 10202
% 9.12/6.05  # Removed by relevancy pruning/SinE    : 9574
% 9.12/6.05  # Initial clauses                      : 1128
% 9.12/6.05  # Removed in clause preprocessing      : 33
% 9.12/6.05  # Initial clauses in saturation        : 1095
% 9.12/6.05  # Processed clauses                    : 4227
% 9.12/6.05  # ...of these trivial                  : 175
% 9.12/6.05  # ...subsumed                          : 1900
% 9.12/6.05  # ...remaining for further processing  : 2152
% 9.12/6.05  # Other redundant clauses eliminated   : 679
% 9.12/6.05  # Clauses deleted for lack of memory   : 0
% 9.12/6.05  # Backward-subsumed                    : 28
% 9.12/6.05  # Backward-rewritten                   : 47
% 9.12/6.05  # Generated clauses                    : 52237
% 9.12/6.05  # ...of the previous two non-redundant : 48289
% 9.12/6.05  # ...aggressively subsumed             : 0
% 9.12/6.05  # Contextual simplify-reflections      : 11
% 9.12/6.05  # Paramodulations                      : 51428
% 9.12/6.05  # Factorizations                       : 8
% 9.12/6.05  # NegExts                              : 0
% 9.12/6.05  # Equation resolutions                 : 694
% 9.12/6.05  # Disequality decompositions           : 0
% 9.12/6.05  # Total rewrite steps                  : 12008
% 9.12/6.05  # ...of those cached                   : 10263
% 9.12/6.05  # Propositional unsat checks           : 0
% 9.12/6.05  #    Propositional check models        : 0
% 9.12/6.05  #    Propositional check unsatisfiable : 0
% 9.12/6.05  #    Propositional clauses             : 0
% 9.12/6.05  #    Propositional clauses after purity: 0
% 9.12/6.05  #    Propositional unsat core size     : 0
% 9.12/6.05  #    Propositional preprocessing time  : 0.000
% 9.12/6.05  #    Propositional encoding time       : 0.000
% 9.12/6.05  #    Propositional solver time         : 0.000
% 9.12/6.05  #    Success case prop preproc time    : 0.000
% 9.12/6.05  #    Success case prop encoding time   : 0.000
% 9.12/6.05  #    Success case prop solver time     : 0.000
% 9.12/6.05  # Current number of processed clauses  : 1297
% 9.12/6.05  #    Positive orientable unit clauses  : 206
% 9.12/6.05  #    Positive unorientable unit clauses: 7
% 9.12/6.05  #    Negative unit clauses             : 109
% 9.12/6.05  #    Non-unit-clauses                  : 975
% 9.12/6.05  # Current number of unprocessed clauses: 45674
% 9.12/6.05  # ...number of literals in the above   : 169610
% 9.12/6.05  # Current number of archived formulas  : 0
% 9.12/6.05  # Current number of archived clauses   : 751
% 9.12/6.05  # Clause-clause subsumption calls (NU) : 132583
% 9.12/6.05  # Rec. Clause-clause subsumption calls : 52172
% 9.12/6.05  # Non-unit clause-clause subsumptions  : 941
% 9.12/6.05  # Unit Clause-clause subsumption calls : 3942
% 9.12/6.05  # Rewrite failures with RHS unbound    : 0
% 9.12/6.05  # BW rewrite match attempts            : 335
% 9.12/6.05  # BW rewrite match successes           : 117
% 9.12/6.05  # Condensation attempts                : 4227
% 9.12/6.05  # Condensation successes               : 56
% 9.12/6.05  # Termbank termtop insertions          : 1057865
% 9.12/6.05  # Search garbage collected termcells   : 95881
% 9.12/6.05  
% 9.12/6.05  # -------------------------------------------------
% 9.12/6.05  # User time                : 1.097 s
% 9.12/6.05  # System time              : 0.054 s
% 9.12/6.05  # Total time               : 1.151 s
% 9.12/6.05  # Maximum resident set size: 24560 pages
% 9.12/6.05  
% 9.12/6.05  # -------------------------------------------------
% 9.12/6.05  # User time                : 1.530 s
% 9.12/6.05  # System time              : 0.069 s
% 9.12/6.05  # Total time               : 1.599 s
% 9.12/6.05  # Maximum resident set size: 20484 pages
% 9.12/6.05  % E---3.1 exiting
% 9.12/6.06  % E exiting
%------------------------------------------------------------------------------